# -*- coding: UTF-8 -*-
import bisect
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase
from collections import defaultdict


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def wordCount(self, startWords: List[str], targetWords: List[str]) -> int:
        def word_mask(word: str) -> int:
            res = 0
            for ch in word:
                res |= 1 << (ord(ch) - ord('a'))
            return res

        start_word_masks = set()

        for word in startWords:
            mask = word_mask(word)
            for i in range(26):
                if mask & (1 << i) == 0:
                    start_word_masks.add(mask | 1 << i)
        ans = 0
        for word in targetWords:
            mask = word_mask(word)
            if mask in start_word_masks:
                ans += 1

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        (["ant", "act", "tack"], ["tack", "act", "acti"], 2),
        (["ab", "a"], ["abc", "abcd"], 1),
        (["mox", "bj", "rsy", "jqsh"], ["trk", "vjb", "jkr"], 1),
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]

        expect = case_item[len(case_item) - 1]

        exec_result = solution.wordCount(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

